package de.uniLuebeck.tcs.algorithmics;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		SudokuInstance Array;
		Sudoku sudoku = new Sudoku();
		
		try {
			BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream( "sampleInput.txt" )));
		
			Array = sudoku.readNewInstance(reader);
			sudoku.boundedBacktrack(0, new ArrayList<SudokuInstance>(), Array);
			/*
			for (int i=0; i<Array.length;i++){
				String t = new String();
				for (int j=0;j<Array.length;j++){
					t = t+Array[i][j]+" ";
				}
				System.out.println(t);
			}*/
		
		} catch (FileNotFoundException e) {
			e.printStackTrace();
			
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
